Approximation of signals (functions) of Lip(α, p), (p > 1)-class by trigonometric polynomials
نویسندگان
چکیده
منابع مشابه
Approximation By Trigonometric Polynomials
These notes are prepared as lecture notes exclusively for the participants of this conference only. Any reproduction in any media, or any use for any other purpose of any part of this manuscript, without an expressed written consent of the author is unlawful.thorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright notation thereon. The views and conc...
متن کاملDIFFERENTIABILITY PROPERTIES OF p-TRIGONOMETRIC FUNCTIONS
p-trigonometric functions are generalizations of the trigonometric functions. They appear in context of nonlinear differential equations and also in analytical geometry of the p-circle in the plain. The most important ptrigonometric function is sinp(x). For p > 1, this function is defined as the unique solution of the initial-value problem (|u′(x)|p−2u′(x))′ = (p− 1)|u(x)|p−2u(x), u(0) = 0, u′(...
متن کاملApproximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling
In this paper, we present algorithms for the approximation of multivariate periodic functions by trigonometric polynomials. The approximation is based on sampling of multivariate functions on rank-1 lattices. To this end, we study the approximation of periodic functions of a certain smoothness. Our considerations include functions from periodic Sobolev spaces of generalized mixed smoothness. Re...
متن کاملApproximation of multivariate functions by trigonometric polynomials based on rank-1 lattice sampling
In this paper, we present algorithms for the approximation of multivariate functions by trigonometric polynomials. The approximation is based on sampling of multivariate functions on rank-1 lattices. To this end, we study the approximation of functions in periodic Sobolev spaces of dominating mixed smoothness. Recently an algorithm for the trigonometric interpolation on generalized sparse grids...
متن کاملDiscrete Least Squares Approximation by Trigonometric Polynomials
We present an efficient and reliable algorithm for discrete least squares approximation of a real-valued function given at arbitrary distinct nodes in [0, 2tt) by trigonometric polynomials. The algorithm is based on a scheme for the solution of an inverse eigenproblem for unitary Hessenberg matrices, and requires only O(mn) arithmetic operations as compared with 0(mn ) operations needed for alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Publications de l'Institut Mathematique
سال: 2018
ISSN: 0350-1302,1820-7405
DOI: 10.2298/pim1818251k